How CSMA/CA With Deferral Affects Performance and Dynamics in Power-Line Communications

Power-line communications (PLC) are becoming a key component in home networking, because they provide easy and high-throughput connectivity. The dominant MAC protocol for high data-rate PLC, the IEEE 1901, employs a CSMA/CA mechanism similar to the backoff process of 802.11. Existing performance evaluation studies of this protocol assume that the backoff processes of the stations are independent (the so-called decoupling assumption). However, in contrast to 802.11, 1901 stations can change their state after sensing the medium busy, which is regulated by the so-called deferral counter. This mechanism introduces strong coupling between the stations and, as a result, makes existing analyses inaccurate. In this paper, we propose a performance model for 1901, which does not rely on the decoupling assumption. We prove that our model admits a unique solution for a wide range of configurations and confirm the accuracy of the model using simulations. Our results show that we outperform current models based on the decoupling assumption. In addition to evaluating the performance in steady state, we further study the transient dynamics of 1901, which is also affected by the deferral counter.Comment: To appear, IEEE/ACM Transactions on Networking 201

A Scalable Share Differentiation Architecture for Elastic and Real-Time Traffic

Today's Internet leacks the mechanisms necessary for traffic isolation (to divide resources fairly) and differentiation (to allocate resources to users according to their willingness to pay). In this work, we present a new architecture for relative service differentiation, Scalable Share Differentiation (SSD), which allocates network resources on a user basis and properly provides for both elastic and real-time traffic isolation and meaningful differentiation. SSD does not require the storage of any per-flow or per-user information at the core nodes and is inherently designed to work without admission control, making it easier to deploy and manage. In addition, we present how to provide more fine-grained flow control to users without changing the concepts of SSD, which permits users to choose different priorities for their packets/flows. This allows the integration of a novel concept for improving the service quality given to user flows: user-based admission control. With user-based admission control, the network is unaware of admission control decisions, and the user himself can perform the tasks of accepting, rejecting and prioritizing flows

SBSD: A Relative Differentiated Services Architecture based on Bandwidth Shares

With this work, we present a scalable relative differentiated services architecture based on bandwidth shares: Scalable Bandwidth Share Differentiation (SBSD). SBSD has been designed to provide isolation and differentiation of user traffic without per-flow or per-user state at the core nodes. In addition, SBSD preserves this isolation and differentiation when being scaled over domain boundaries. The presented SBSD architecture leads to a weighted maxmin fair bandwidth distribution with respect to each user's sending rate. The novelty of the resulting fairness distribution is that ist is user-based, in contrast to traditional fairness criteria dealing with flows. Even though SBSD operates at a per-user granularity, it allows more fine-grained differentiation, which we use to demonstrate how multicast can be integrated in a straight-forward manner and how SBSD can be optimized for end-to-end TCP congestion control

μ\muNap: Practical Micro-Sleeps for 802.11 WLANs

In this paper, we revisit the idea of putting interfaces to sleep during 'packet overhearing' (i.e., when there are ongoing transmissions addressed to other stations) from a practical standpoint. To this aim, we perform a robust experimental characterisation of the timing and consumption behaviour of a commercial 802.11 card. We design $\mu$Nap, a local standard-compliant energy-saving mechanism that leverages micro-sleep opportunities inherent to the CSMA operation of 802.11 WLANs. This mechanism is backwards compatible and incrementally deployable, and takes into account the timing limitations of existing hardware, as well as practical CSMA-related issues (e.g., capture effect). According to the performance assessment carried out through trace-based simulation, the use of our scheme would result in a 57% reduction in the time spent in overhearing, thus leading to an energy saving of 15.8% of the activity time.Comment: 15 pages, 12 figure

A Channel Assignment and Routing Algorithm for Energy Harvesting Multi-Radio Wireless Mesh Networks

Wireless mesh networks are being deployed all around the world both to provide ubiquitous connection to the Internet and to carry data generated by several services (video surveillance, smart grids, earthquake early warning systems, etc.). In those cases where fixed power connections are not available, mesh nodes operate by harvesting ambient energy (e.g., solar or wind power) and hence they can count on a limited and time-varying amount of power to accomplish their functions. Since we consider mesh nodes equipped with multiple radios, power savings and network performance can be maximized by properly routing flows, assigning channels to radios and identifying nodes/radios that can be turned off. Thus, the problem we address is a joint channel assignment and routing problem with additional constraints on the node power consumption, which is NP-complete. In this paper, we propose a heuristic, named minimum power channel assignment and routing algorithm (MP-CARA), which is guaranteed to return a local optimum for this problem. Based on a theoretical analysis that we present in the paper, which gives an upper bound on the outage probability as a function of the constraint on power consumption, we can guarantee that the probability that a node runs out of power with MP-CARA falls below a desired threshold. The performance of MP-CARA is assessed by means of an extensive simulation study aiming to compare the solutions returned by MP-CARA to those found by other heuristics proposed in the literature.Publicad

Thwarting Selfish Behavior in 802.11 WLANs

The 802.11e standard enables user configuration of several MAC parameters, making WLANs vulnerable to users that selfishly configure these parameters to gain throughput. In this paper we propose a novel distributed algorithm to thwart such selfish behavior. The key idea of the algorithm is for honest stations to react, upon detecting a selfish station, by using a more aggressive configuration that penalizes this station. We show that the proposed algorithm guarantees global stability while providing good response times. By conducting a game theoretic analysis of the algorithm based on repeated games, we also show its effectiveness against selfish stations. Simulation results confirm that the proposed algorithm optimizes throughput performance while discouraging selfish behavior. We also present an experimental prototype of the proposed algorithm demonstrating that it can be implemented on commodity hardware.Comment: 14 pages, 7 figures, journa

Mobility through Heterogeneous Networks in a 4G Environment

Serving and Managing users in a heterogeneous environment. 17th WWRF Meeting in Heidelberg, Germany, 15 - 17 November 2006. [Proceeding presented at WG3 - Co-operative and Ad-hoc Networks]The increase will of ubiquitous access of the users to the requested services points towards the integration of heterogeneous networks. In this sense, a user shall be able to access its services through different access technologies, such as WLAN, Wimax, UMTS and DVB technologies, from the same or different network operators, and to seamless move between different networks with active communications. In this paper we propose a mobility architecture able to support this users’ ubiquitous access and seamless movement, while simultaneously bringing a large flexibility to access network operators